Not being (super)thin or solid is hard: A study of grid Hamiltonicity
نویسندگان
چکیده
Article history: Received 11 November 2007 Received in revised form 20 November 2008 Accepted 20 November 2008 Available online 11 December 2008 Communicated by R. Fleischer
منابع مشابه
Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs
In 2007, Arkin et al. [3] initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we pro...
متن کاملComparison of Stiffness and Failure Behavior of the Laminated Grid and Orthogrid Plates
The present paper investigates the advantages of a new class of composite grid structures over conventional grids. Thus far, a known grid structure such as orthogrid or isogrid has been used as an orthotropic layer with at most in-plane anisotropy. The present laminated grid is composed of various numbers of thin composite grid layers. The stiffness of the structure can be adjusted by choosing ...
متن کاملWettability of Liquid Mixtures on Porous Silica and Black Soot Layers
Sophisticated manipulation of surface roughness and solid surface energy are widely used to design super-hydrophobic layers. In this work, we designed highly porous silica layer with contact angle (CA) of 145°, and its robustness was promoted with thermal treatment. Wettability of coated layer is studied with CA measurement for different liquid surface tensions using diluted organi...
متن کاملAn approximation algorithm for the longest cycle problem in solid grid graphs
Although, the Hamiltonicity of solid grid graphs are polynomial-time decidable, the complexity of the longest cycle problem in these graphs is still open. In this paper, by presenting a linear-time constant-factor approximation algorithm, we show that the longest cycle problem in solid grid graphs is in APX. More precisely, our algorithm finds a cycle of length at least 2n 3 + 1 in 2-connected ...
متن کاملHamiltonicity of Topological Grid Graphs
In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of the usual square lattice graph of the plane. The main results are as follows. The shortness coefficient of the family of all topological grid graphs is at most 16/17. Every 3-connected topological grid graph is hamiltonian.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 42 شماره
صفحات -
تاریخ انتشار 2009